Minimum cost-reliability ratio path problem
نویسنده
چکیده
The problem of finding a minimal cost-reliability ratio path is considered. The optimal solution to this problem is shown to map into an extreme supported non-dominated objective point in the objective space of the biobjective shortest path problem. Different forms of reliability are presented. We assume that this reliability does not change over time. We employ a parametric network simplex algorithm to compute all extreme supported nondominated objective points. A sufficiency conditions introduced by Ahuja [1] are used to reduce the path enumeration. Our algorithm is based on the method of Sedeño-Noda and González-Martín. A numerical example is provided to illustrate the algorithm. [Abdallah W. Aboutahoun. Minimum Cost-Reliability Ratio Path Problem. Life Sci J 2012; 9(3):1633-1645] (ISSN: 1097-8135). http://www.lifesciencesite.com. 239
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملInverse Optimization
In this paper, we study inverse optimization problems defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x0 be a given feasible solution. The solution x0 may or may not be an optimal solution of P with respect to the cost vector c. The inverse optimization problem is to perturb the cost vector c to d so that x0 is a...
متن کاملتعیین نوع و زمانبندی بهینه نگهداری و تعمیرات پیشگیرانه سیستمهای چند‌جزیی بر اساس قابلیت اطمینان
In this research, a model for optimal PM planning based on reliability is developed and solved for multi-component systems. In the proposed model, the type of PM actions for each inspection period is determined in such manner that the total weighted related costs are minimized while a minimum required system reliability is maintained. The planning horizon is divided into some inspections interv...
متن کاملMIT Sloan School of Management Working Paper 4390 - 02 August 2002 DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS
In this paper, we study dynamic shortest path problems that determine a shortest path from a specified source node to every other node in the network where arc travel times change dynamically. We consider two problems: the minimum time walk problem and the minimum cost walk problem. The minimum time walk problem is to find a walk with the minimum travel time. The minimum cost walk problem is to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 15 شماره
صفحات -
تاریخ انتشار 1988